Nearest-neighbor correlations in the Hubbard model
نویسندگان
چکیده
منابع مشابه
Universal Relations in the Attractive Hubbard Model with Next-Nearest Neighbor Hopping
Institute of Physics, A. Mickiewicz University Umultowska 85, 61-614 Poznań, Poland Recently a new universal relation between superfluid density ρs and σdcTc, where σdc is direct current conductivity and Tc — superconducting critical temperature, was found by Homes et al. (Nature 430, 539 (2004)). The theoretical derivation of the relation based on BCS theory is correct only qualitatively. In t...
متن کاملCorrelations Beyond the Nearest-Neighbor Level in Grain Boundary Networks
Correlations among ‘special’ and ‘general’ grain boundaries are studied on two-dimensional networks, by examining the configurational entropy of boundary structures as well as percolation thresholds. Consideration of crystallographic constraints at various length scales reveals that higher-order constraints play a role in boundary connectivity and network structure. Implications for grain bound...
متن کاملEvaluation Accuracy of Nearest Neighbor Sampling Method in Zagross Forests
Collection of appropriate qualitative and quantitative data is necessary for proper management and planning. Used the suitable inventory methods is necessary and accuracy of sampling methods dependent the inventory net and number of sample point. Nearest neighbor sampling method is a one of distance methods and calculated by three equations (Byth and Riple, 1980; Cotam and Curtis, 1956 and Cota...
متن کاملNearest Neighbor
Over the last decade, an immense amount of data has become available. From collections of photos, to genetic data, and to network traffic statistics, modern technologies and cheap storage have made it possible to accumulate huge datasets. But how can we effectively use all this data? The ever growing sizes of the datasets make it imperative to design new algorithms capable of sifting through th...
متن کاملNon-zero probability of nearest neighbor searching
Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics Letters A
سال: 1998
ISSN: 0375-9601
DOI: 10.1016/s0375-9601(98)00391-0